منابع مشابه
From lattices to H v – matrices
In this paper we study the concept of sets of elements, related to results of an associative binary operation. We discuss this issue in the context of matrices and lattices. First of all, we define hyperoperations similar to those used when constructing hyperstructures from quasiordered semigroups. This then enables us to show that if entries of matrices are elements of lattices, these consider...
متن کاملReconstruction of hv-convex binary matrices from their absorbed projections
The reconstruction of hv-convex binary matrices from their absorbed projections is considered. Although this problem is NP-hard if the non-absorbed row and column sums are available, it is proved that such a reconstruction problem can be solved in polynomial time from absorbed projections when the absorption is represented by =(1+ √ 5)=2. Also a reconstruction algorithm is given to determine th...
متن کاملA simulated annealing for reconstructing hv-convex binary matrices
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two projections. This variant is reformulated as an integer programming problem and approximated by simulated annealing approach.
متن کاملConference Matrices and Unimodular Lattices
We use conference matrices to define an action of the complex numbers on the real Euclidean vector space R. In certain cases, the lattice D n becomes a module over a ring of quadratic integers. We can then obtain new unimodular lattices, essentially by multiplying the lattice D n by a non-principal ideal in this ring. We show that lattices constructed via quadratic residue codes, including the ...
متن کاملOptimal decompositions of matrices with entries from residuated lattices
We describe optimal decompositions of matrices whose entries are elements of a residuated lattice L, such as L = [0, 1]. Such matrices represent relationships between objects and attributes with the entries representing degrees to which attributes represented by columns apply to objects represented by rows. Given such an n×m object-attribute matrix I, we look for a decomposition of I into a pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analele Universitatii "Ovidius" Constanta - Seria Matematica
سال: 2016
ISSN: 1844-0835
DOI: 10.1515/auom-2016-0055